Complex Query Processing on Web Graph: a Social Network Perspective
نویسندگان
چکیده
A social network represents a social community as a directed graph. Communication on the Web has given rise to social network formation like, Web Community, Referral System etc. An earlier effort has proposed a data model for such Web-based social network. Present paper discusses the relevant index structures for processing queries on a social network schema based upon the proposed data model. The paper has also provided evaluation of the structural operators proposed in the data model and discussed their efficacy with query examples.
منابع مشابه
Efficient Application of Complex Graph Analytics on Very Large Real World RDF Datasets
RDF [1] Graph modeling is a foundational technology in the whole semantic web (SW) technology stack. Since its debut in 2004, RDF graph has enjoyed many applications in the enterprise domain. Examples of these applications include, but certainly not limited to, integration and federated query of heterogeneous data sources, flexible and extensible representation of enterprise knowledge base, adh...
متن کاملSQTime: Time-Enhanced Social Search Querying
In this paper, we present SQTime, a system for social search queries that exploit temporal information available in social networks. Specifically, SQTime introduces different types of queries aiming at satisfying information needs from different perspectives. SQTime is built upon a social graph and query model both augmented with time, and develops methods for query processing and time-dependen...
متن کاملVisual Analytics and the Language of Web Query Logs - A Terminology Perspective
This paper explores means to integrate natural language processing methods for terminology and entity identification in medical web session logs with visual analytics techniques. The aim of the study is to examine whether the vocabulary used in queries posted to a Swedish regional health web site can be assessed in a way that will enable a terminologist or medical data analysts to instantly ide...
متن کاملA Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databases, social network analysis and the Semantic Web. To efficiently evaluate reachability queries on large graph-structured databases, there has been a host of recent research on graph indexing. To date, reachability ind...
متن کاملgSketch: On Query Estimation in Graph Streams
Many dynamic applications are built upon large network infrastructures, such as social networks, communication networks, biological networks and the Web. Such applications create data that can be naturally modeled as graph streams. In the graph stream model, edges of the underlying graph are received and updated sequentially in a form of a stream. It is often necessary and important to summariz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JDIM
دوره 6 شماره
صفحات -
تاریخ انتشار 2008